Modal Logics for Reasoning about Object-based Component Composition
نویسنده
چکیده
Component-oriented development of software supports the adaptability and maintainability of large systems, in particular if requirements change over time and parts of a system have to be modified or replaced. The software architecture in such systems can be described by components and their composition. In order to describe larger architectures, the composition concept becomes crucial. We will present a formal framework for component composition for object-based software development. The deployment of modal logics for defining components and component composition will allow us to reason about and prove properties of components and compositions.
منابع مشابه
A Coalgebraic Approach to Quantitative Linear Time Logics
We define quantitative fixpoint logics for reasoning about linear time properties of states in systems with branching behaviour. We model such systems as coalgebras whose type arises as the composition of a branching monad with one or more polynomial endofunctors on the category of sets. The domain of truth values for our logics is determined by the choice of branching monad, as is the special ...
متن کاملModal Logics for Reasoning about Preferences and Cooperation: Expressivity and Complexity
This paper gives a survey of expressivity and complexity of normal modal logics for reasoning about cooperation and preferences. We identify a class of notions expressing local and global properties relevant for reasoning about cooperative situations involving agents that have preferences. Many of these notions correspond to gameand social choice-theoretic concepts. We specify what expressive p...
متن کاملComplexity Results for Some Logics of Inconsistent Belief
Modal logics of knowledge have been used to represent and reason about such varied topics as distributed and multi-agent systems, security protocols, and interactive proof systems. We investigate a class of modal logics for representing agents or systems with imperfect or inconsistent knowledge. These logics replace the usual closure under full conjunction for the ¤ operator with progressively ...
متن کاملExpressivity and Complexity of Reasoning about Coalitional Interaction: Extended Abstract
This paper studies expressivity and complexity of normal modal logics for reasoning about coalitional power in multi-agent systems with agents that have preferences. A class of local and global notions relevant for reasoning about cooperation is identified. Many of these notions naturally correspond to concepts from game theory or social choice theory. The expressive power required to express t...
متن کاملA Logic for Reasoning about Explicit Knowledge in Finite Agents (Abstract)
The Problem Epistemic logics are logics for reasoning about knowledge in systems of agents. Traditional modal epistemic logics are information-theoretical, in the sense that they consider knowledge about propositions and that agents know everything that follows from the information they possess. Although proved useful in many applications, this view is unrealistic when modeling explicit knowled...
متن کامل